IMPLEMENTATION OF SERIAL AND PARALLEL BUBBLE SORT ON FPGA
نویسندگان
چکیده
منابع مشابه
Efficient FPGA-Implementation of Two’s Complement Digit-Serial/Parallel Multipliers
This paper presents an efficient implementation of digit-serial/parallel multipliers on 4-input look-up table (LUT)-based field programmable gate arrays (FPGAs). This subset of FPGA devices hide individual gate delays and add important wiring delay. These two facts produce important changes over the theoretical advantages of each topology. Architectural transformations are applied to obtain top...
متن کاملBubble Sort on SCMFSA
We present the bubble sorting algorithm using macro instructions such as the if-Macro (conditional branch macro instructions) and the TimesMacro (for-loop macro instructions) etc. The correctness proof of the program should include the proof of autonomic, halting and the correctness of the program result. In the three terms, we justify rigorously the correctness of the bubble sorting algorithm....
متن کاملFPGA-based Accelerators for Parallel Data Sort
The paper is dedicated to parallel data sort based on sorting networks. The proposed methods and circuits have the following characteristics: 1) using two-level parallel comparators in even-odd transition networks with feedback to a register keeping input/intermediate data; 2) parallel merging of many sorted sequences; 3) using even-odd transition networks built from other sorting networks; 4) ...
متن کاملRun Time Bubble Sort – An Enhancement of Bubble Sort
In many real applications, sorting plays an important role as it makes easy to handle the data by arranging it in ascending or descending order, according to requirements. Bubble sort is most common sorting algorithm, but not efficient for many applications. There are number of other sorting algorithms and still, research is going for new sorting algorithms to improve the complexities of existi...
متن کاملDecision Sort and its Parallel Implementation
In this paper, a sorting technique is presented that takes as input a data set whose primary key domain is known to the sorting algorithm, and works with an time efficiency of O(n+k), where k is the primary key domain. It is shown that the algorithm has applicability over a wide range of data sets. Later, a parallel formulation of the same is proposed and its effectiveness is argued. Though thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Ilmu Komputer dan Informasi
سال: 2016
ISSN: 2088-7051,1979-0732
DOI: 10.21609/jiki.v9i2.378